recursion relation

См. также в других словарях:

• Recursion (computer science) — Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. [cite book last = Epp first = Susanna title = Discrete Mathematics with Applications year=1995… …   Wikipedia

• Recursion — Recursion, in mathematics and computer science, is a method of defining functions in which the function being defined is applied within its own definition. The term is also used more generally to describe a process of repeating objects in a self… …   Wikipedia

• Well-founded relation — In mathematics, a binary relation, R, is well founded (or wellfounded) on a class X if and only if every non empty subset of X has a minimal element with respect to R; that is, for every non empty subset S of X, there is an element m of S such… …   Wikipedia

• Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… …   Wikipedia

• Forcing (recursion theory) — Forcing in recursion theory is a modification of Paul Cohen s original set theoretic technique of forcing to deal with the effective concerns in recursion theory. Conceptually the two techniques are quite similar, in both one attempts to build… …   Wikipedia

• Recurrence relation — Difference equation redirects here. It is not to be confused with differential equation. In mathematics, a recurrence relation is an equation that recursively defines a sequence, once one or more initial terms are given: each further term of the… …   Wikipedia

• Anonymous recursion — In computer science, anonymous recursion is a recursion technique that uses anonymous functions. Construction Suppose that f is an n argument recursive function defined in terms of itself:: f(x 1, x 2, dots, x n) := mbox{expression in terms of }… …   Wikipedia

• Panjer recursion — The Panjer recursion is an algorithm to compute the probability distribution of a compound random variable: S = sum {i=1}^N X i.,.where both N, and X i, are stochastic and of a special type. It was introduced in a paper of Harry Panjer [ cite… …   Wikipedia

• Finitary relation — This article sets out the set theoretic notion of relation. For a more elementary point of view, see Binary relation. For a combinatorial viewpoint, see Theory of relations. For other uses, see Relation (disambiguation). In set theory and logic,… …   Wikipedia

• Skein relation — A central question in the mathematical theory of knots is whether two knot diagrams represent the same knot. One tool used to answer such questions is a knot polynomial which is an invariant of the knot. If two diagrams have different polynomials …   Wikipedia

• Hermite polynomials — In mathematics, the Hermite polynomials are a classical orthogonal polynomial sequence that arise in probability, such as the Edgeworth series; in combinatorics, as an example of an Appell sequence, obeying the umbral calculus; in numerical… …   Wikipedia